On optimal smoothing of density estimators obtained from orthogonal polynomial expansion methods
نویسندگان
چکیده
منابع مشابه
On orthogonal polynomials obtained via polynomial mappings
Let (pn)n be a given monic orthogonal polynomial sequence (OPS) and k a fixed positive integer number such that k ≥ 2. We discuss conditions under which this OPS originates from a polynomial mapping in the following sense: to find another monic OPS (qn)n and two polynomials πk and θm , with degrees k and m (resp.), with 0 ≤ m ≤ k − 1, such that pnk+m(x) = θm(x)qn(πk(x)) (n = 0, 1, 2, . . .). In...
متن کاملthe effect of traffic density on the accident externality from driving the case study of tehran
در این پژوهش به بررسی اثر افزایش ترافیک بر روی تعداد تصادفات پرداخته شده است. به این منظور 30 تقاطع در شهر تهران بطور تصادفی انتخاب گردید و تعداد تصادفات ماهیانه در این تقاطعات در طول سالهای 89-90 از سازمان کنترل ترافیک شهر تهران استخراج گردید و با استفاده از مدل داده های تابلویی و نرم افزار eviews مدل خطی و درجه دوم تخمین زده شد و در نهایت این نتیجه حاصل شد که تقاطعات پر ترافیک تر تعداد تصادفا...
15 صفحه اولConsistency of orthogonal series density estimators based on grouped observations
The aim of this note is to indicate that nonparametric orthogonal series estimators of probability densities retain the mean integrated square error (MISE) consistency when observations are grouped to the points of a uniform grid (prebinned). This kind of grouping is typical for computer rounding errors and may also be useful in data compression, before calculating estimates, e.g., using the FF...
متن کاملOn Local Smoothing of Nonparametric Curve Estimators
We begin by analyzing the local adaptation properties of wavelet-based curve estimators. It is argued that while wavelet methods enjoy outstanding adaptability in terms of the manner in which they capture irregular episodes in a curve, they are not nearly as adaptive when considered from the viewpoint of tracking more subtle changes in a smooth function. We point out that while this problem may...
متن کاملOptimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm
The concept of an “approximation algorithm” is usually only applied to optimization problems, since in optimization problems the performance of the algorithm on any given input is a continuous parameter. We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Risk
سال: 2016
ISSN: 1465-1211
DOI: 10.21314/j0r.2016.324